package com.mayajie.binarytree;

/**
 * 二叉树的顺序存储结构
 * @author mayajie
 * @date 2021/10/26
 */
public class SequentialStorage {
    private int[] ints;

    /**
     *         1
     *     2      3
     *   4   5  6   7
     */
    public void save() {

        ints[1] = 1;
        ints[2] = 2;
        ints[3] = 3;
        ints[4] = 4;
        ints[5] = 5;
        ints[6] = 6;
        ints[7] = 7;
        ints[8] = 8;
    }
}
